Mesh-Partitioning with the Multiple Ant-Colony Algorithm
نویسندگان
چکیده
We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The first method augments the multiple ant-colony algorithm with a multilevel paradigm, whereas the second uses the multiple ant-colony algorithm as a refinement to the initial partition obtained by vector quantization. The two methods are experimentally compared with the well-known mesh-partitioning programs.
منابع مشابه
A Multilevel Ant-colony-optimization Algorithm for Mesh Partitioning
In this paper we present a multilevel ant-colony optimization algorithm, which is a relatively new metaheuristic technique for solving combinatorial optimization problems. We apply this algorithm to the mesh partitioning problem, which is an important problem with extensive applications in various real world engineering problems. The algorithm outperforms the classical kMETIS and Chaco algorith...
متن کاملMesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses the mesh partitioning problem. In this paper we present an enhancement of the technique that uses nature inspired metaheuristic to achieve higher quality partitions. We apply and study a multilevel ant-colony (MACO) opti...
متن کاملAn Experimental Study of an Ant-colony Algorithm for the Mesh-partitioning Problem
Parallel computer systems are suitable for solving computationally intensive numerical methods such as finite-volume and finite-element methods for solving partial differential equations. A program and associated data are distributed among the processors. The aim is to find a distribution where the communication is as low as possible. This leads to the mesh-partitioning optimization problem, wh...
متن کاملSolving the mesh-partitioning problem with an ant-colony algorithm
Many real-world engineering problems can be expressed in terms of partial differential equations and solved by using the finite-element method, which is usually parallelised, i.e. the mesh is divided among several processors. To achieve high parallel efficiency it is important that the mesh is partitioned in such a way that workloads are well balanced and interprocessor communication is minimis...
متن کاملA Distributed Multilevel Ant Colonies Approach for Graph Partitioning
The paper presents a distributed implementations of an ant colony optimization metaheuristic for the solution of a mesh partitioning problem. The usefulness and efficiency of the algorithm, in its sequential form, to solve that particular optimization problem has already been shown in previous work. In this paper a straightforward implementations on a distributed architecture is presented and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004